Descending Packing Algorithm for Irregular Graphics Based on Geometric Feature Points
نویسندگان
چکیده
منابع مشابه
Multiresolution based overlap minimization algorithm for irregular packing problems
Irregular nesting is a subgroup of cutting and packing problems in which a set of irregular items must be inserted in a rectangular container with a variable width. It is often found in industries such as textile, wood and shipbuilding and an efficient solution usually renders an economical and environmental positive impact. Due to the complex geometry of items, the no overlapping rule is hard ...
متن کاملAn iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
The irregular strip packing problem is a combinatorial optimization problem that asks to place a given set of 2-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The ob...
متن کاملExtended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
This paper presents an extended local search algorithm (ELS) for the irregular strip packing problem. It adopts two neighborhoods, swapping two given polygons in a placement and placing one polygon into a new position. The local search algorithm is used to minimize the overlap on the basis of the neighborhoods mentioned above and the unconstrained nonlinear programming model is adopted to furth...
متن کاملA Feature Points Matching Algorithm Based on Wavelet Analysis
In this paper, we present an application of wavelet analysis on feature points matching. Wavelet coefficients which produced by wavelet transform can best display part character of the image. Through the new feature description and feature matching method, we can build a feature point database for each image and improve the efficiency of feature points matching. The experimental results show th...
متن کاملSampling feature points for contour tracking with graphics hardware
We present in this paper a GPU-accelerated algorithm for sampling contour points and normals from a generic CAD model of a 3D object, in order to aid contour-based real-time tracking algorithms. The procedure achieves fast computation rates for generic meshes consisting of polyhedral, non-convex as well as smooth surfaces. This method is part of a general purpose, multi-camera and multi-target ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2020/8854838